A Stubborn Set Algorithm for Optimal Planning
نویسندگان
چکیده
We adapt a partial order reduction technique based on stubborn sets, originally proposed for detecting dead ends in Petri Nets, to the setting of optimal planning. We demonstrate that stubborn sets can provide significant state space reductions on standard planning benchmarks, outperforming the expansion core method.
منابع مشابه
Stubborn Sets for Fully Observable Nondeterministic Planning
The stubborn set method is a state-space reduction technique, originally introduced in model checking and then transfered to classical planning. It was shown that stubborn sets significantly improve the performance of optimal deterministic planners by considering only a subset of applicable operators in a state. Fully observable nondeterministic planning (FOND) extends the formalism of classica...
متن کاملIntegrating Partial Order Reduction and Symmetry Elimination for Cost-Optimal Classical Planning
Pruning techniques based on partial order reduction and symmetry elimination have recently found increasing attention for optimal planning. Although these techniques appear to be rather different, they base their pruning decisions on similar ideas from a high level perspective. In this paper, we propose safe integrations of partial order reduction and symmetry elimination for cost-optimal class...
متن کاملBounded Intention Planning Revisited
Bounded Intention Planning (BIP) [7] is a pruning approach for optimal planning with unary operators. BIP has the flavor of partial order reduction, which has recently found increasing interest for optimal planning [4, 6]. However, although BIP is claimed to be a variant of stubborn sets [3] in the original paper, no proof is given for this claim. In this paper, we shed light on the relationshi...
متن کاملSleep Sets Meet Duplicate Elimination
The sleep sets technique is a path-dependent pruning method for state space search. In the past, the combination of sleep sets with graph search algorithms that perform duplicate elimination has often shown to be error-prone. In this paper, we provide the theoretical basis for the integration of sleep sets with common search algorithms in AI that perform duplicate elimination. Specifically, we ...
متن کاملFinding Small Stubborn Sets Automatically
State space generation is often needed in the analysis of concurrent and distributed systems. The stubborn set method is one of the techniques that try to alleviate the state space explosion encountered in state space generation. An algorithm for nding a stubborn set having as few enabled transitions as possible is presented. Practicality of the algorithm is motivated with the aid of examples.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012